Distributed Exact Shortest Paths in Sublinear Time

Improved Distributed Algorithms for Exact Shortest Paths

Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Henzinger, Krinninger, and Nanongkai [STOC’16] which deterministically computes (1 + o(1))-approximate shortest paths in Õ(D + √ n) time, where D is the h...

Euclidean Shortest Paths - Exact or Approximate Algorithms

Time - Varying K Shortest Paths

Distributed Exact Weighted All-Pairs Shortest Paths in (n5/4) Rounds

Solving fundamental graph problems, such as shortest paths, minimum cut and maximum flow, on distributed networks (in the so-called CONGEST model) is a central question in distributed computing. By allowing approximate solutions, rapid progress has been made in recent years resulting in tight algorithms and lower bounds in many cases. However, pretty much nothing is known for solving many of th...

Shortest paths between shortest paths

We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...